Determining Maximum itk-Width Connectivity on Meshes
نویسندگان
چکیده
Let I be a n n binary image stored in a n n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of 1-pixels there exists a path of width k (composed of 1-pixels only). We consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture.
منابع مشابه
Determining Maximum k-Width-Connectivity on Meshes
Let I be a n n binary image stored in a n n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of 1-pixels there exists a path of width k (composed of 1-pixels only). We consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture.
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملImplementing the Automatic Generation of 3D Statistical Shape Models with ITK
We describe a method to automatically find the point correspondences between a collection of polygonal genus 0 meshes. This correspondence data is the key for building three-dimensional statistical shape models, which have a variety of applications in medical imaging. Our method is based on minimizing a cost function that describes the goodness of correspondence. Apart from a cost function deri...
متن کاملAnimation Model Simplifications
In this paper, we propose a new framework for the representation of deforming meshes by only updating necessary changes of the connectivity. The deforming meshes, which is also known as time-varying surfaces, are often constructed with static connectivity. To progressively represent the deforming meshes with level-of-details, people can simplify the meshes independently to obtain good simplific...
متن کاملCompressing Hexahedral Volume Meshes
Unstructured hexahedral volume meshes are of particular interest for visualization and simulation applications. They allow regular tiling of the three-dimensional space and show good numerical behaviour in finite element computations. Beside such appealing properties, volume meshes take huge amount of space when stored in a raw format. In this paper we present a technique for encoding connectiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992